A Heuristic Approach to Solving the Train Traffic Re-Scheduling Problem in Real Time

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Train traffic control by re-planning in real-time

Today’s train traffic control systems are most often designed with a focus on controlling the technology rather than on to support the train traffic controller in achieving optimal traffic solutions. Train dispatchers often have to interact with many separate information systems in order to understand the traffic situation, to make decisions and to perform control tasks. An integrated and compl...

متن کامل

Network-centric approach to adaptive real-time train scheduling

When solving complex railway management automation tasks, one constantly has to deal with a lot of disruptive events, which differ in intensity and source and can lead to conflicts and fluctuations in schedules of passenger, suburban and cargo trains. This makes matters even worse in large-scale railway systems with a high level of connectivity. Today solving conflict situations in trains devia...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2018

ISSN: 1999-4893

DOI: 10.3390/a11040055